Notes on a Search for Optimal Lattice Rules
نویسندگان
چکیده
In this paper some of the results of a recent computer search CoLy99] for optimal three-and four-dimensional lattice rules of speciied trigonometric degree are discussed. The theory is presented in a general frame emphasising the special nature of lattice rules among the rules of speciied trigonometric degree. 1 Background Material In this paper we discuss some of the results of a recent computer search CoLy99] for optimal s-dimensional lattice rules of speciied trigonometric degree. An s-dimensional cubature formula (or rule) Qf for 0 1) s is a weighted sum of function values
منابع مشابه
Three- and four-dimensional K-optimal lattice rules of moderate trigonometric degree
A systematic search for optimal lattice rules of specified trigonometric degree d over the hypercube [0, 1)s has been undertaken. The search is restricted to a population K(s, δ) of lattice rules Q(Λ). This includes those where the dual lattice Λ⊥ may be generated by s points h for each of which |h| = δ = d+ 1. The underlying theory, which suggests that such a restriction might be helpful, is p...
متن کاملFive- and six-dimensional lattice rules generated by structured matrices
We describe the results of a computer-based search for 5 and 6dimensional lattice rules of specified trigonometric degree. In this search only lattice rules that can be generated by a circulant or skew-circulant generator matrix are considered, which makes this approach significantly faster than earlier approaches. The drawback is that we do not necessarily obtain optimal lattice rules. We also...
متن کاملConstruction Algorithms for Generalized Polynomial Lattice Rules
Recently, generalized digital nets were introduced and shown to achieve almost optimal convergence rates when used in a quasi-Monte Carlo algorithm to approximate high-dimensional integrals over the unit cube. Since their inception, one method of constructing generalized digital nets from classical digital nets has been known. However, the desirable features of generalized digital nets motivate...
متن کاملGRISK: An Internet Based Search for K-Optimal Lattice Rules
This paper describe the implementation and underlying philosophie of a large scale distributed computation of K-optimal lattice rules. The computation is huge corresponding to the equivalent of 36 years computation on a single workstation. In this paper we describe our implementation, how we have built in fault tolerence and our strategy for administrating a world wide computation on computer w...
متن کاملFive-dimensional K-optimal lattice rules
A major search program is described that has been used to determine a set of five-dimensional K-optimal lattice rules of enhanced trigonometric degrees up to 12. The program involved a distributed search, in which approximately 190 CPU-years were shared between more than 1,400 computers in many parts of the world.
متن کامل